The Modular Isomorphism Problem: A Survey

نویسندگان

چکیده

The Modular Isomorphism Problem asks if an isomorphism of group algebras two finite p-groups G and H over a field characteristic p, implies isomorhism the groups H. We survey history problem, explain strategies which were developed to study it present recent negative solution problem. problem is also compared other problems for rings various question remaining open are included.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The modular isomorphism problem for the groups of order 512

For a prime p let G be a finite p-group and K a field of characteristic p. The Modular Isomorphism Problem (MIP) asks whether the modular group algebra KG determines the isomorphism type of G. We briefly survey the history of this problem and report on our computer-aided verification of the Modular Isomorphism Problem for the groups of order 512 and the field K with 2 elements.

متن کامل

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

The Graph Isomorphism Problem

The graph isomorphism problem can be easily stated: check to see if two graphs that look di erently are actually the same. The problem occupies a rare position in the world of complexity theory, it is clearly in NP but is not known to be in P and it is not known to be NP-complete. Many sub-disciplines of mathematics, such as topology theory and group theory, can be brought to bear on the proble...

متن کامل

The Boolean Isomorphism Problem

We investigate the computational complexity of the Boolean Isomorphism problem (BI): on input of two Boolean formulas F and G decide whether there exists a permutation of the variables of G such that F and G become equivalent. Our main result is a one-round interactive proof for BI, where the veriier has access to an NP oracle. To obtain this, we use a recent result from learning theory by Bsho...

متن کامل

The Module Isomorphism Problem Reconsidered

Algorithms to decide isomorphism of modules have been honed continually over the last 30 years, and their range of applicability has been extended to include modules over a wide range of rings. Highly efficient computer implementations of these algorithms form the bedrock of systems such as GAP and Magma, at least in regard to computations with groups and algebras. By contrast, the fundamental ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Jahresbericht der Deutschen Mathematiker-Vereinigung

سال: 2022

ISSN: ['1869-7135', '0012-0456']

DOI: https://doi.org/10.1365/s13291-022-00249-5